Approximation algorithm - PDFSEARCH.IO - Document Search Engine

Approximation algorithm
Results: 454

#	Item
411	Part II Approximation Algorithms Add to Reading List Source URL: www2.informatik.hu-berlin.de Language: English - Date: 2011-02-08 14:10:43 Operations research Mathematical optimization Combinatorial optimization NP-complete problems Knapsack problem Polynomial-time approximation scheme Dynamic programming Approximation algorithm Algorithm Theoretical computer science Computational complexity theory Applied mathematics
412	CS 598CSC: Approximation Algorithms Instructor: Chandra Chekuri Add to Reading List Source URL: courses.engr.illinois.edu Language: English - Date: 2009-02-06 16:43:24 Operations research NP-complete problems Combinatorial optimization Dynamic programming Knapsack problem Bin packing problem Polynomial-time approximation scheme Approximation algorithm Linear programming relaxation Theoretical computer science Computational complexity theory Applied mathematics
413	Optimal computation Ronald A. DeVore∗ Add to Reading List Source URL: www.mathunion.org Language: English - Date: 2012-04-18 10:58:44 Computational complexity theory Numerical analysis Approximation theory Information-based complexity Sobolev space Derivative Approximation algorithm Radial basis function network Mathematical analysis Mathematics Theoretical computer science
414	Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning Nader H. Bshouty∗ ([removed]) Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2004-05-06 04:06:20 Complexity classes Approximation algorithm Time complexity ZPP NP Theoretical computer science Computational complexity theory Applied mathematics
415	Approximation Algorithms for Maximum Independent Set of Pseudo-Disks Timothy M. Chan1 Add to Reading List Source URL: sarielhp.org Language: English - Date: 2012-08-03 11:55:38 Approximation algorithm Computational complexity theory Independent set NP-complete Theoretical computer science Applied mathematics NP-complete problems
416	Coping With NP-Hardness Approximation Algorithms Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2001-05-07 12:05:44 Operations research NP-complete problems Combinatorial optimization Approximation algorithms Travelling salesman problem Christofides algorithm Polynomial-time approximation scheme Optimization problem Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics
417	Copyright Springer Heidelberg[removed]On-screen viewing permitted. Printing not permitted. Please buy this book at your bookshop. Order information see http://www.springeronline.com[removed] Add to Reading List Source URL: www.jhuapl.edu Language: English - Date: 2008-01-21 16:28:58 Mathematical optimization Statistics Operations research Estimation theory Statistical theory Genetic algorithm Combinatorial optimization Stochastic approximation Loss function Mathematics Applied mathematics Stochastic optimization
418	Approximation Algorithms for Lawn Mowing and Milling Esther M. Arkin† Add to Reading List Source URL: www.ict.griffith.edu.au Language: English - Date: 2008-03-24 22:30:58 NP-complete problems Operations research Travelling salesman problem Computational problems Approximation algorithm Optimization problem NP Minimum spanning tree Reduction Theoretical computer science Computational complexity theory Applied mathematics
419	J. C. SPALL An Overview of the Simultaneous Perturbation Method Add to Reading List Source URL: www.jhuapl.edu Language: English - Date: 2012-03-27 11:38:06 Stochastic optimization Cybernetics Simultaneous perturbation stochastic approximation Stochastic approximation SPSA Genetic algorithm Gradient descent Global optimization Evolutionary algorithm Numerical analysis Mathematics Mathematical optimization
420	An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ Add to Reading List Source URL: www.siam.org Language: English - Date: 2009-12-02 12:21:54 Spanning tree Minimum spanning tree Loop-erased random walk Chernoff bound Eulerian path NP-complete problems Dominating set Holomorphic functional calculus Graph theory Mathematics Theoretical computer science

UPDATE